Search results for "hybrid algorithm"

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems

1997

In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.

A Robust Multi Stage Technique for Image Binarization of Degraded Historical Documents

2017

International audience; Document image binarization is a central problem in many document analysis systems. Indeed, it represents one of the basic challenges, especially in case of historical documents analysis. In this paper, we propose a novel robust multi stage framework that combines different existing document image thresholding methods for the purpose of getting a better binarization result. CLAHE technique is introduced to significantly enhance contrast in some poor images. The proposed method then uses a hybrid algorithm to partition image into foreground and background. A special procedure is finally applied in order to remove small noise and correct characters morphology. Experime…

The hybrid algorithm (Hbmr) to fight against blood doping in sports

2010

A hybrid algorithm for planning public charging stations

2014

International audience; Green mobility solutions are receiving currently an enormous attention. Indeed, during last years, electric vehicles, being part of the field of the smart-grid, entered the automobile market of the whole world. This technology requires an effective deployment of charging stations of electric refill since the main problem in this system remains over the duration of refill of the batteries. In this work, we propose an optimized algorithm to locate electric charging stations. The main task of the algorithm is to find the best site of charging stations locations so as to minimize loss on the way to the charging station, as well as minimize investment cost, we take into a…

A Hybrid Algorithm Based on WiFi for Robust and Effective Indoor Positioning

2019

Indoor positioning based on the Wireless Fidelity (WiFi) protocol and the Pedestrian Dead Reckoning (PDR) approach is widely exploited because of the existing WiFi infrastructure in buildings and the advancement of built-in smartphone sensors. In this work, a hybrid algorithm that combines WiFi fingerprinting and PDR to both exploit their advantages as well as limiting the impact of their disadvantages is proposed. Specifically, to build a probability map from noisy Received Signal Strength (RSS), a Gaussian Process (GP) regression is deployed to estimate and construct the RSS fingerprints with incomplete data. Mean and variance of generated points are used to estimate WiFi fingerprinting p…

Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts

2015

Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…

Towards adaptive localization in wireless sensor networks

2012

It is often useful or even indispensable to know the locations of the nodes in a wireless sensor network (WSN), from both network functionality and applications point of view. A potential yet one of the most challenging method is to utilize received signal strength indicator (RSSI) for distance estimation. Albeit easily adopted, using of RSSI is notorious for imprecise distance estimates which can lead to inaccuracies in location estimates. In this paper, we study RSSI-based localization in WSNs through simulation experiments. We evaluate and compare a hybrid algorithm and its modifications with well-known range-based and range-free localization algorithms. Simulation results indicate that …

Optimization of Complex SVM Kernels Using a Hybrid Algorithm Based on Wasp Behaviour

2010

The aim of this paper is to present a new method for optimization of SVM multiple kernels The kernel substitution can be used to define many other types of learning machines distinct from SVMs We introduced a new hybrid method which uses in the first level an evolutionary algorithm based on wasp behaviour and on the co-mutation operator LR−Mijn and in the second level a SVM algorithm which computes the quality of chromosomes The most important details of our algorithms are presented The testing and validation proves that multiple kernels obtained using our genetic approach are improving the classification accuracy up to 94.12% for the “leukemia” data set.

Scheduling a cellular manufacturing system with GA

2002

The flexible manufacturing cell scheduling problem is considered with a multi-objective approach, pursuing together makespan minimisation and the in process job wait minimisation. The formulation of the scheduling problem is discussed, analysing how to generate well suited sequences, like generalised permutation sequences, and the proper construction of a JIT timing of activities. An evolutionary sequencing algorithm based on both classic genetic operators and hybrid operators is then proposed. The hybrid operators have been introduced to construct highly fit initial population, to perform periodically a local search on the population and to maintain enough genetical diversity in the actual…